The Boyce-Codd-Heath Normal Form for SQL

نویسندگان

  • Flavio Ferrarotti
  • Sven Hartmann
  • Henning Köhler
  • Sebastian Link
  • Millist W. Vincent
چکیده

In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints and functional dependencies is more expressive than the class of functional dependencies itself. Hence, the Boyce-Codd-Heath normal form is not suitable for SQL databases. We characterize the associated implication problem of the combined class in the presence of NOT NULL constraints axiomatically, algorithmically and logically. Based on these results we are able to establish a suitable normal form for SQL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a r t i c l e i n f o a b s t r a c t The theory of functional dependencies is based on relations, i.e. sets of tuples. Over...

متن کامل

Some Problems Related to Keys and the Boyce-Codd Normal Form

The aim of this paper is to investigate the connections between minimal keys and antikeys for special Sperner-systems by hypergraphs. The BoyceCodd normal form and some related problems are also studied in this paper.

متن کامل

Implementing an Automated Normalization System for Functional Independent Normal Form in Relational Databases

A deductive system for automated database normalization is implemented by using a HiLog reasoning engine. The system allows for checking a relational schema up to Boyce-Codd normal form (BCNF) and functional independency normal form (FINF). Examples of system usage are presented and discussed.

متن کامل

Finding Faithful Boyce-Codd Normal Form Decompositions

It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NPhard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach ...

متن کامل

A Visualization Tool for Teaching and Learning Database Decomposition System

Database designers and students of computer science in tertiary institutions find it difficult to learn database theory in which database decomposition is a major aspect. This work presents a visualization tool to simplify the study of decomposition algorithms behaviours which would assist the students and database designers to decompose any relational schema with its functional dependencies in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011